A Product Form Extension for Discrete-Time Communication Protocols
نویسنده
چکیده
A discrete-time communication framework is studied under an approximate socalled "stop protocol" related to the lost-calls-held protocol. An explicit insensitive product form expression as recently obtained under a less realistic recirculated protocol is shown to remain valid. This extension seems of both practical and theoretical interest. Applications include: • Circuit switching structures • MAN-allocation schemes • CSMA and BTMA • Rude-CSMA
منابع مشابه
An Insensitive Product Form for Discrete-Time Communication Networks
Discrete-time communication networks are studied as due to digital transmissions. Simultaneous multiple transmission requests and completions as well as blocking are hereby involved. Scheduling times and packet lengths are allowed to have a general discrete distribution. A discrete-time product form result is obtained for the steady-state busy source distribution. Particularly, this form is sho...
متن کاملModule-Amenability on Module Extension Banach Algebras
Let $A$ be a Banach algebra and $E$ be a Banach $A$-bimodule then $S = A oplus E$, the $l^1$-direct sum of $A$ and $E$ becomes a module extension Banach algebra when equipped with the algebras product $(a,x).(a^prime,x^prime)= (aa^prime, a.x^prime+ x.a^prime)$. In this paper, we investigate $triangle$-amenability for these Banach algebras and we show that for discrete inverse semigroup $S$ with...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملOn the Arrival Theorem for Communication Networks
The arrival theorem is investigated for communication networks that exhibit a product form. Two types of blocking protocols are distinguished: • a delay protocol • a retransmission protocol. (i) Under the delay protocol the arrival theorem is shown to f all. (ii) Under the more realistic retransmission protocol, however, the arrival theorem is shown to be generally valid provided the product fo...
متن کامل